Cellular network handoff modeling

ABSTRACT

Disclosed is a system for evaluating the performance of cellular network handoff decisions. One embodiment of this system includes the steps of: creating a reference cellular network description; creating reduced geometric structures from the reference cellular network description; representing a general trajectory for a mobile unit in the reference cellular network description; approximating the general trajectory with a piecewise path having a multitude of handoff decision points; selecting a handoff mechanism; selecting handoff parameters; creating a discrete-time formulation characterizing handoff behaviors; and calculating at least one handoff performance metric. The handoff performance metrics may include assignment probabilities; handoff probabilities; a mean number of handoff value; a crossover point; and overall signaling load incurred by a handoff mechanism.

CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims the benefit of provisional patent application: Ser. No. 60/413,449 to Mark et al., filed on Sep. 26, 2002, entitled “Cellular Network Handoffs,” which is hereby incorporated by reference.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

The U.S. Government has a paid-up license in this invention and the right in limited circumstances to require the patent owner to license others on reasonable terms as provided for by the terms of Grant No. AC10133390, awarded by the National Science Foundation.

BACKGROUND OF THE INVENTION

The present invention relates to the field of cellular network systems. In particular, the present invention provides for efficient modeling and analysis of cellular handoff decision mechanisms used in cellular networks.

In cellular networks, each mobile station (MS) maintains connectivity via an active set of base stations (BS). A handoff algorithm determines the dynamics of the active set as the MS moves through the network. In hard handoff, the MS is “handed off” from one BS to another BS as it leaves the cell coverage area of the first BS and enters that of the second BS. In this case, the active set of an MS consists of at most one BS at any given time. Hard handoff algorithms are used in the GSM (Global System for Mobile Communications) and GPRS wireless networking standards and are still under active investigation for use in High Data Rate (HDR) services.

Wireless technologies based on CDMA generally employ soft handoff, whereby the MS maintains an active set that may contain multiple BSs. A soft handoff occurs whenever a BS enters or leaves the active set of an MS. Soft handoff algorithms are used in the IS-95 and cdma2000 standards and have been proposed for use in the WCDMA standard.

The handoff behavior of mobile units in a cellular network may be critical to the overall performance of the network in terms of quality-of-service, resource utilization, and signaling load. Ideally, the network should maintain seamless quality-of-service for an active mobile user engaged in a call as it traverses cell boundaries. Even when the mobile station is in the idle state, the choice of cell assignment set may impact the network in terms of resource utilization and signaling load, as well as the quality-of-service experienced by the MS when it transits to the active state. Thus, the proper design and dimensioning of the handoff algorithm may be crucial to the deployment of a cellular network.

What is needed is a discrete-time framework for analyzing the performance of handoff algorithms executed by an MS based on pilot signal strength measurements from candidate BSs.

Vijayan and Holtzman were among the first to propose an analytical model for handoff based on signal strength measurements. (See R. Vijayan and J. M. Holtzman, “A Model for Analyzing Handoff Algorithms,” IEEE Trans. on Vehicular Technology, vol. 42, pp. 351–356, August 1993.) They modeled the trajectory of a mobile station as a continuous-time process wherein handoffs corresponded to the level-crossing events of the relative signal strength between two candidate base stations. They further argued that the level-crossing events could be modeled approximately by Poisson processes with time-varying rate functions. A limitation of the Poisson level-crossing model is that it is accurate only for relatively high level-crossings. Furthermore, when the model is applied to the realistic scenario of sampled signal measurements, the sampling interval must be sufficiently small for the model assumptions to hold. Another limitation of this model is that it is applicable only to relative signal strength measurements and may not accommodate constraints on absolute signal strength.

Subsequently, Zhang and Holtzman proposed an alternative approach to analyzing handoff based on the Gaussian properties of the sampled and processed received signal strengths. (See N. Zhang and J. M. Holtzman, “Analysis of Handoff Algorithms Using Both Absolute and Relative Measurements,” IEEE Trans. on Vehicular Technology, vol. 45, pp. 174–179, February 1996.) Their approach incorporated absolute signal strength thresholds in the handoff algorithm. Approximations for the handoff probabilities are obtained by making some simplifying assumptions. However, one skilled in the art will observe that the approximate formulas disclosed in this article may be inaccurate, particularly when relative signal strength alone is used as the basis for handoff. What is needed is a handoff model that can utilize an exact discrete-time model based on the Gaussian properties of received signal strengths.

In many papers related to handoff analysis, the MS trajectory under consideration is limited to the straight line directly connecting the two candidate base stations involved in the handoff. However, handoff behavior may depend strongly on the trajectory followed by the MS. For arbitrary MS trajectories, simulation-based methods have been the only alternative for obtaining accurate performance measures. What is also needed is a system that can utilize a representation of a general trajectory in a cellular network capable of yielding a concise characterization of handoff performance over a wide range of MS trajectories in the network.

Early work on handoff analysis has largely been based on computer simulation studies. In industrial practice, computer simulation remains the primary means for choosing key parameters to optimize the performance of modern-day wireless networks. Detailed computer simulations of wireless cellular networks require considerable computation time, making them cumbersome to use for the purposes of network design and dimensioning.

What is needed is a system capable of modeling the efficiency of handoff mechanisms in various cellular networks.

BRIEF SUMMARY OF THE INVENTION

One advantage of the present invention is that it provides a discrete-time formulation for handoff problem(s).

Another advantage of this invention is that it characterizes the handoff behavior of a given mobile station in terms of cell assignment events associated with a discrete-time random process determined by the averaged measurements of signal strengths received from base stations.

Another advantage of this invention is that it provides an efficient numerical procedure to compute the handoff performance measures.

Yet a further advantage of this invention is that it uses an exact discrete-time model based on the Gaussian properties of received signal strengths.

To achieve the foregoing and other advantages, in accordance with the invention as embodied and broadly described herein, the present invention includes a discrete-time framework for analyzing the performance of handoff algorithms executed by an MS based on pilot signal strength measurements from candidate BSs.

In yet a further aspect of the invention, the handoff mechanisms may be primarily hard handoff mechanisms, which may be applicable to networks based on the GSM and GPRS standards.

In yet a further aspect of the invention, the handoff mechanisms may be primarily soft handoff mechanisms, which may be applicable to networking standards such as IS-95 and cdma2000.

In yet a further aspect of the invention, the handoff mechanisms may be both hard and soft handoff mechanisms.

Additional objects, advantages and novel features of the invention will be set forth in part in the description which follows and in part will become apparent to those skilled in the art upon examination of the following or may be learned by practice of the invention. The objects and advantages of the invention may be realized and attained by means of the instrumentalities and combinations particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part of the specification, illustrate an embodiment of the present invention and, together with the description, serve to explain the principles of the invention.

FIG. 1 is a diagram showing a straight-line trajectory between two base stations in a cellular network.

FIG. 2 is a diagram showing assignment regions based on relative signal strength.

FIG. 3 is a diagram showing assignment regions based on relative signal strengths with absolute thresholds.

FIG. 4 is a diagram showing nonlinear assignment regions.

FIG. 5 is a diagram showing handoff as a crossing level problem.

FIG. 6 is a diagram showing a mobile trajectory in a cellular network.

FIG. 7 is a diagram showing a reduced geometric structure.

FIG. 8 is a diagram showing a minimum geometric structure.

FIG. 9 is a diagram showing straight-line trajectories within a minimum geometric structure.

FIG. 10 shows probabilities of being assigned to station BS_(i) along the trajectory Tr1 with h=1.

FIG. 11 shows probabilities of being assigned to base station BS_(i) along the trajectory Tr2 with h=1.

FIG. 12 shows probabilities of being assigned to station BS_(i) along the trajectory Tr1 with h=3.

FIG. 13 shows probabilities of being assigned to station BS_(i) along the trajectory Tr2 with h=10.

FIG. 14 shows probabilities of handoff from BS_(i) to BS_(j) along the trajectory Tr1 with h=3.

FIG. 15 shows probabilities of handoff from BS_(i) to BS_(j) along the trajectory Tr2 with h=3.

FIG. 16 shows probabilities of handoff from BS_(i) to BS_(j) along the trajectory Tr2 with h=10.

FIG. 17 shows analysis and simulation for the mean number of handoff following the trajectory Tr1.

FIG. 18 shows analysis and simulation for the mean number of handoff following the trajectory Tr2.

FIG. 19 shows delays in handing off following the trajectory Tr1.

FIG. 20 shows delays in handing off following the trajectory Tr2.

FIG. 21 shows crossover points vs. mean number of handoffs for Tr1.

FIG. 22 shows crossover points vs. mean number of handoffs for Tr2.

FIG. 23 shows mean number of handoffs, h=1.

FIG. 24 shows mean number of handoffs, h=3.

FIG. 25 shows a cellular network scenario for soft handoff.

FIG. 26 shows a grid structure for soft handoff evaluation.

FIG. 27 shows a flow diagram of an embodiment of an aspect of the present invention.

FIG. 28 shows a block diagram of an embodiment of an aspect of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

The handoff mechanism employed in a cellular network may have a significant impact on overall network performance. Evaluation of handoff mechanism performance has for the most part been carried out using brute-force computer simulation or simplified approximations. The present invention utilizes a new discrete-time framework for evaluating the performance of handoff mechanisms such as hard handoff algorithms based on pilot signal strength measurements. Analytical expressions and associated numerical procedures for evaluating the cell assignment and handoff probabilities of a mobile station moving along a linear trajectory are disclosed. By approximating an arbitrary trajectory with a piecewise linear path, a complete characterization of the overall handoff performance of a cellular network under a given set of parameters may be obtained. This invention provides an accurate and efficient means for the design and dimensioning of high performance handoff algorithms.

The starting point of the present invention is a discrete-time formulation of the handoff problem. The formulation characterizes the handoff behavior of a given mobile station in terms of cell assignment events associated with a discrete-time random process determined by the averaged measurements of signal strengths received from base stations. From the formulation, expressions may be derived for the cell assignment and handoff probabilities at each sampling epoch along a trajectory traversed by the MS. In the present best mode of the invention, the trajectory is an arbitrary straight-line trajectory. However, one skilled in the art will recognize that other trajectories may be utilized. A numerical procedure may then be developed to compute handoff performance measures.

To characterize handoff performance for arbitrary trajectories in a cellular network, a general path may be approximated by a piecewise linear path within a reduced geometric structure derived from the cellular network geometry. A concise characterization of the mean number of handoffs over a wide range of mobile trajectories in the network may then be obtained. This characterization preferably provides a measure of the overall signaling load incurred by the handoff algorithm.

A basic signal propagation system model for a general class of handoff algorithms will be discussed. This discussion will first focus on a familiar continuous-time setting and then on a discrete-time setting, providing the basis for subsequent discussion. The signal propagation model is primarily for the pilot signal strength used by handoff algorithms. The propagation model preferably provides the basis for analyzing the handoff performance of an MS traveling along a straight-line trajectory at constant speed in a cellular network. A discrete-time version of this model may be used in subsequent analysis of handoff performance.

The cellular network consists of a set of base stations. The i^(th) base station, BS_(i), located by a position vector b_(i), lies approximately at the center of its associated cell i. The coverage area of cell i may be determined by the pilot signal strength from BS_(i). Assuming that the MS is initially located at position a at time 0 and connected to BS_(i), the MS may reach position b at time T, moving at a constant speed of v along the line segment between a and b. As the MS moves along this trajectory, the candidate BS for handoff as shown in FIG. 1 is BS_(j). The MS may make handoff decisions based on measurements of the pilot signal strengths received from the two base stations BS_(i) and BS_(j). The position, r(t), of the mobile user at time t may be given as follows: r(t)=a+vte;0≦t≦T, where e is the unit vector in the direction of the vector b−a.

The pilot signal strength (in dB) received from a BS as a function of distance in typical urban mobile environments may be modeled empirically as the sum of three components: path loss, shadow fading, and fast fading. The path loss may be a deterministic function of the distance d from the BS, while the shadow and fast fading components may be modeled as random processes. This model has been used in a number of studies of handoff performance in cellular networks. Under the assumption of constant MS speed along the straight-line trajectory, the pilot signal strength may be equivalently expressed as a function of a continuous-time parameter t.

We will now describe a continuous-time model. The pilot signal strength (in dB), received at the mobile from BS_(i) at time t may be represented as follows: Y _(i)(t)=m _(i)(t)+W _(i)(t)+Z _(i)(t);t≧0,  (1) where m _(i)(t)=v _(i) −u _(i) log(∥r(t)−b _(i)(t)∥),  (2) and {W_(i)(t)},iεC are independent, zero mean stationary Gaussian processes. The term m_(i)(t) accounts for path loss, while W_(i)(t) models the effect of lognormal (shadow) fading and Z_(i)(t) models fast fading. The autocorrelation function of W_(i)(t) has been experimentally observed to have the form:

$\begin{matrix} {{{{Rw}_{i}(\tau)} = {\sigma^{2}w_{i}{\exp\left( {- \frac{v{\tau }}{d_{0}}} \right)}}},} & (3) \end{matrix}$ where σw_(i) is the standard deviation of the shadowing signal strength and the constant do is called the decay factor.

To eliminate the effect of fast fading, the MS applies an exponential averaging window to the measured signal strength Y_(i)(t). The impulse response of the averaging window may be given by

$\begin{matrix} {{{f_{av}(t)} = {\frac{1}{d_{av}}{\exp\left( {- \frac{vt}{d_{av}}} \right)}}},{t \geq 0},} & (4) \end{matrix}$ where d_(av) determines the effective size of the averaging window. The processed pilot signal strength from base station BS_(i) may then given by X _(i)(t)=f _(av)(t)*Y _(i)(t);t≧0,  (5) where * denotes the standard convolution operation.

Handoff performance based on a discrete-time model for the signal strength measurements will now be discussed. In the discrete-time model, the mobile unit may sample the pilot signal strengths at time instants t_(k)=kt_(s), where t_(s) is the sampling interval. The distance between successive sampling positions of the mobile may be denoted by d_(s)=vt_(s). The discrete-time model may capture the handoff behavior of an MS more accurately than its continuous-time counterpart since all signal strength measurements are sampled.

In discrete time, the basic signals of the system model may simply be sampled versions of their continuous-time counterparts: Y _(i) [k]=Y _(i)(t _(k));m_(i) [k]=m _(i)(t _(k));W_(i) [k]=W _(i)(t _(k));k>0,  (6)

The processes {W_(i)[k]}, iεC, are independent, zero-mean, stationary Gaussian processes characterized by an autocorrelation function which may be given by:

$\begin{matrix} {{{{Rw}_{i}(m)} = {\sigma^{2}w_{i}{\exp\left( \frac{{- {m}}d_{s}}{d_{0}} \right)}}},} & (7) \end{matrix}$ One skilled in the art will recognize that the cross-correlation between received signal strengths may easily be incorporated into this model.

The shadow fading process {W_(i)[k]} cyan be represented as a first order autoregressive (AR) process by the following difference equation: W _(i) [k]=aW _(i) [k−1]+V _(i) [k];k≧0,  (8) where {V_(i)[k]} is a zero mean, stationary white Gaussian noise process with variance σ_(v) _(i) ². The parameters, (a, σ_(v) _(i) ²), of the AR model preferably determine an autocorrelation function for {W_(i)[k]} of the form

$\begin{matrix} {{{Rw}_{i}(m)} = {\sigma_{v_{i}}^{2}\frac{a^{m}}{1 - a^{2}}}} & (9) \end{matrix}$

By comparing (9) and (7), the AR parameters for shadow fading may be determined as follows:

$\begin{matrix} {{a = {\exp\left( {- \frac{d_{s}}{d_{0}}} \right)}},} & (10) \end{matrix}$ σ² _(v) _(i) =(1−a ²)σ_(w) _(i) ²,  (11)

The discrete-time equivalent of the exponential smoothing window may be given by

$\begin{matrix} {{{f_{av}\lbrack k\rbrack} = {\frac{1}{d_{av}}{\exp\left( \frac{- {kd}_{s}}{d_{av}} \right)}}},{k \geq 0}} & (12) \end{matrix}$

The processed pilot signal strength from base station BS_(i) may then be obtained as follows: X _(i) [k]=f _(av) [k]*Y _(i) [k], k≧0  (13)

where * is used here to denote discrete-time convolution. Note that the measured signal strength Y_(i)[k] may be expressed as: Y _(i) [k]=m _(i) [k]+W _(i) [k]  (14)

The relative processed signal strength between base stations BS_(i) and BS_(j) may be given by X[k]=X _(i) [k]−X _(j) [k].  (15)

The evolution of the process {X_(i)[k]} may be governed by the following second-order difference equation:

$\begin{matrix} {{{X_{i}\lbrack k\rbrack} = {{\left( {a + b} \right){X_{i}\left\lbrack {k - 1} \right\rbrack}} - {{abX}_{i}\left\lbrack {k - 2} \right\rbrack} + {\frac{1}{d_{av}}\left( {{m_{i}\lbrack k\rbrack} - {{am}_{i}\left\lbrack {k - 1} \right\rbrack}} \right)} + {\frac{1}{d_{av}}{V_{i}\lbrack k\rbrack}}}},{k \leq 2}} & (16) \end{matrix}$

$\begin{matrix} {{{X_{i}\lbrack 1\rbrack} = {\frac{1}{d_{av}}\left\{ {\left( {{{bm}_{i}\lbrack 0\rbrack} + {m_{i}\lbrack 1\rbrack}} \right) + {\left( {a + b} \right){V_{i}\lbrack 0\rbrack}} + {V_{i}\lbrack 1\rbrack}} \right\}}},} & (17) \end{matrix}$

$\begin{matrix} {{X_{i}\lbrack 0\rbrack} = {\frac{1}{d_{av}}{\left( {{{bm}_{i}\lbrack 0\rbrack} + {V_{i}\lbrack 0\rbrack}} \right).}}} & (18) \end{matrix}$ From (16), we see that {X_(i)[k]} is a second-order AR process, a fact that may be exploited later. Various statistical properties of the signal strength process {X_(i)[k]} that may be used in sequels may also be derived.

A model for hysteresis-based hard handoff mechanisms including a new formulation of the handoff problem and the possibility of using a Monte Carlo simulation to obtain handoff performance measures will now be discussed. The MS may make a handoff decision based on the processed pilot signal strengths from the two candidate base stations. In other words, a handoff decision made at time t may be based on the vector X(t)=(X_(i)(t), X_(j)(t)) in two-dimensional space

². A large class of so-called hysteresis-based handoff algorithms may be characterized in terms of a partition of

² into three regions (shown in FIGS. 2, 3, and 4):

I: the assignment region for BS_(i),

J: the assignment region for BS_(j),

H: the hysteresis region, where the MS may be assigned either to BS_(i) or BS_(j).

A handoff decision at time t>0 may be made as follows:

1. If X(t)εI then a handoff occurs to BS_(i) unless the MS is already assigned to BS_(i).

2. If X(t)εJ then a handoff occurs to BS_(j) unless the MS is already assigned to BS_(j).

3. If X(t)εH then no handoff occurs.

At time t=0 the MS becomes active and is assigned to BS_(i) if X_(i)(0)>X_(j)(0) and otherwise to BS_(j). In this case, the hysteresis level is effectively zero and there are only two assignment regions:

I₀={(x_(j); x_(i)): x_(i)>x_(j)}: the assignment region for BS_(i) at time 0,

J₀={(x_(j); x_(i)): x_(i)<x_(j)}: the assignment region for BS_(j) at time 0.

With the above formulation of hysteresis-based handoff, some important special cases may be considered. A class of handoff algorithms preferably operates on the basis of the relative processed signal strength from BS_(i) and BS_(j): X(t)=X _(i)(t)−X _(j)(t)  (19)

A handoff of the mobile user from base station BS_(i) to base station BS_(j) may occur when the relative processed signal strength X(t) falls below the value −h_(j). Conversely, a handoff from base station BS_(j) to base station BS_(i) may occur when X(t) exceeds the value h_(i). The values h_(i) and h_(j) may be known as the hysteresis levels associated with base stations BS_(i) and BS_(j), respectively. For handoff algorithms based on relative signal strength, the assignment regions may be given as follows: I={(x _(j) ;x _(i)):x _(i) ≧x _(j) +h _(i)} J={(x _(j) ;x _(i)):x _(i) ≧x _(y) +h _(i)} H={(x _(j);x_(i)):x _(i) −h _(i) <x _(i) <x _(j) +h _(i)}=

²−(I∪j) These regions are illustrated in FIG. 2.

Some handoff mechanisms combine relative signal strength with an absolute threshold on the required pilot signal strength. In such mechanisms, a handoff from BS_(i) to BS_(j) may occur at time t if and only if X(t)<h_(i) and X_(i)(t)<Th_(i), where Th_(i) is the absolute threshold on X_(i)(t). Conversely, a handoff from BS_(j) to BS_(i) may occur at time t if and only if X(t)≧h_(i) and X_(j)(t)<Th_(j). The two-dimensional assignment regions for this handoff algorithm may become: I={(x _(j) ;x _(i)):x _(i) ≧x _(j) +h _(i) and x _(j) <Th _(j)} J={(x _(j) ;x _(i)):x _(i) ≦x _(j) −h _(i) and x _(i) <Th _(i)} H=

²−(I∪J)

These regions are illustrated in FIG. 3. Different specifications of the assignment regions lead to different handoff algorithms. A nonlinear assignment region set is illustrated in FIG. 4.

The handoff behavior of an MS traveling along a given trajectory may be viewed as a two-dimensional level-crossing problem. Handoff events may occur when the process X(t) enters the assignment regions I and J. The level-crossing analogy may be more readily visualized in the case of handoff based on relative signal strength. In this case, the handoff decision may be based on the one-dimensional relative signal strength X(t). Handoff events correspond to level-crossings of the process X(t) with respect to the hysteresis levels h_(i) and −h_(j). Thus, handoffs from BS_(i) to BS_(j) may correspond to downcrossings of −h_(j), while handoffs from BS_(j) to BS_(i) may correspond to upcrossings of h_(i), as can be seen in FIG. 5.

The handoff analysis of Vijayan and Holtzman (discussed in the background section) is based on the level-crossing analogy. In the asymptotic regime, h_(i)=h_(j)→∞, the point process formed by the set of upcrossings of h_(i) and that formed by the set of downcrossings of −h_(i) approach independent Poisson processes. Based on this result, expressions for handoff performance metrics such as handoff probability and cell assignment probability may be obtained. However, as they point out, the Poisson process assumption is only asymptotically true for large h_(i) and h_(j) and is not accurate for smaller values of the hysteresis levels.

In practice, as the MS moves along a given trajectory, it samples and processes the signal strengths from the candidate base stations at discrete time instants. Level crossings between sampling instants do not necessarily lead to actual handoff events. Analysis may rely on the assumption that the sampling interval is sufficiently small such that, at most, one level-crossing event can occur between sampling instants. Thus, the analysis based on the continuous-time model may not capture the effect of varying the sampling interval on handoff behavior.

In the discrete-time model, the relative processed signal strength between base stations BS_(i) and BS_(j) may be given by: X[k]=X_(i)[k]−X_(j)[k], k≧0.  (20)

Correspondingly, we define m[k]=m _(i) [k]−m _(j) [k], V[k]=V _(i) [k]−V _(j) [k], k≧0.  (21) Note that process {X[k]} satisfies the difference equation obtained from (16) if the subscript i is removed, i.e.,

$\begin{matrix} {{X\lbrack k\rbrack} = {{\left( {a + b} \right){X\left\lbrack {k - 1} \right\rbrack}} - {{abX}\left\lbrack {k - 2} \right\rbrack} + {\frac{1}{d_{av}}\left( {{m\lbrack k\rbrack} - {{am}\left\lbrack {k - 1} \right\rbrack}} \right)} + {\frac{1}{d_{av}}{{V\lbrack k\rbrack}.}}}} & (22) \end{matrix}$ For handoff algorithms based on relative signal strength, the cell assignment of the mobile may be determined by the value of X[k], k≧1. In particular, if the mobile is assigned to BS_(i) at time k−1, then a handoff to BS_(j) occurs at time k if and only if X[k]<−h_(j), where h_(j) is the hysteresis level associated with BS_(j). Conversely, if the mobile is assigned to BS_(j) at time k−1, then a handoff to BS_(i) occurs at time k if and only if X[k]>h_(i), where h_(i) is the hysteresis level for BS_(i).

A Monte Carlo sample path of handoff along a trajectory may be generated straightforwardly using the discrete-time model described above. The difference equation characterized by (16)–(18) may determine the processed signal strength {X_(i)[k]}. From (6) and (2), the mean pilot signal strength m_(i)[k] may be given as follows: m _(i) [k]=v _(i)−μ_(i) log(∥a−b _(i) +kvt _(s)∥).  (23) The process {V_(i)[k]} may be simulated simply as a sequence of independent, zero-mean Gaussian random variables with standard deviation σv_(i). The processed signal strength, {V_(i)[k]}, may be generated similarly. The relative signal strength process {V[k]}, given by (20), may completely determine the handoff behavior of the mobile along the trajectory.

For a given straight-line trajectory, the handoff performance measures of interest include:

-   -   Assignment probabilities: Let P_(i)[k] and P_(j)[k],         respectively, denote the probabilities that the mobile is         assigned to BS_(i) and BS_(j) at time k.     -   Handoff probabilities: Let P_(ij)[k] and P_(ji)[k],         respectively, denote the probabilities of a handoff from BS_(i)         to BS_(j) and a handoff from BS_(j) to BS_(i) at time k.     -   Mean number of handoffs: Let N_(ho) denote the number of         handoffs between BS_(i) and BS_(j) over the given trajectory.     -   Crossover point: Let C denote the crossover point, which is         defined as the point along an arbitrary straight-line trajectory         at which the probability of the MS being assigned to BS_(i)         drops below 0:5, given that the probability of assignment to         BS_(i) at time t=0 is greater than 0:5.

To estimate these performance measures using Monte Carlo simulation, N sample paths of the process {X[k]} may be generated. For the nth sample path, define:

$\begin{matrix} {{A_{i}^{(n)}\lbrack k\rbrack} = \begin{Bmatrix} {1,} & {{if}\mspace{14mu}{the}\mspace{14mu}{moblie}\mspace{14mu}{is}\mspace{14mu}{assigned}\mspace{14mu}{to}\mspace{14mu}{BS}_{i}} \\ {0,} & {otherwise} \end{Bmatrix}} & (24) \end{matrix}$

Similarly, A_(j) ^((n))[k]=1 if the mobile is assigned to BS_(j) and is equal to zero otherwise. Since, for this embodiment, it is assumed that the mobile is assigned to exactly one of the two base stations while traversing an arbitrary straight-line trajectory, A_(i) ^((n))[k]+A_(j) ^((n))[k]=1. The Monte Carlo estimate of the cell assignment probability to BS_(i) at time k may then be given by:

$\begin{matrix} {{{\hat{P}}_{i}\lbrack k\rbrack} = {\frac{1}{N}{\sum\limits_{n = 1}^{N}\;{A_{i}^{(n)}\lbrack k\rbrack}}}} & (25) \end{matrix}$ Under the assumption discussed above, we have {circumflex over (P)}_(i)[k]+{circumflex over (P)}_(j)[k]=1.

Let A_(ij) ^((n))[k]=A_(i) ^((n))[k−1]A_(j) ^((n))[k]. Then A_(ij) ^((n))[k]=1 if and only if a handoff from BS_(i) to BS_(j) occurs at time k in the nth sample path. Similarly, A_(ij) ^((n))[k]=A_(j) ^((n))[k−1]A_(i) ^((n))[k] indicates a handoff from BS_(j) to BS_(i) at time k in the nth sample path. The Monte Carlo estimate of the cell handoff probability from BS_(i) to BS_(j) at time k may be:

$\begin{matrix} {{{\hat{P}}_{ij}\lbrack k\rbrack} = {\frac{1}{N}{\sum\limits_{n = 1}^{N}\;{A_{ij}^{(n)}\lbrack k\rbrack}}}} & (26) \end{matrix}$

A similar expression may hold for the estimate, {circumflex over (P)}_(ij)[k], of the cell handoff probability from BS_(j) to BS_(i). Let N_(ho) ^((n)) denote the number of cell handoffs that occur over the nth sample path of the process {X[k]}. The Monte Carlo estimate of the mean number of handoffs may be expressed as:

$\begin{matrix} {{\hat{N}}_{oh} = {{\frac{1}{N}{\sum\limits_{n = 1}^{N}\; N_{ho}^{(n)}}} = {\sum\limits_{k = 1}^{M}\;\left( {{{\hat{P}}_{ij}\lbrack k\rbrack} + {{\hat{P}}_{ji}\lbrack k\rbrack}} \right)}}} & (27) \end{matrix}$ An estimate for the crossover point of the trajectory while the MS travels from cell (i) to cell (j) may be given by Ĉ=arg min{0≦k≦M:{circumflex over (P)} _(i) [k]≦0.5}  (28) where it is assumed that {circumflex over (P)}_(i)[0]≧0.5.

Analytical expressions for the handoff performance measures in discrete-time and an outline for an efficient numerical procedure for computing the handoff performance measures will now be discussed. These analytical expressions for the handoff performance measures may be derived based on the discrete-time model just discussed.

First, assignment probabilities will be considered. The sampled and processed signal strength measurements from BS_(i) and BS_(j) may be represented by the vector process X[k]=(X_(i)[k], X_(j)[k]). Let X[k\r] denote the sequence consisting of the r most recent values of {X[k]} up to and including time k, where 1≦r≦k+1: X[k\r]=(X[k−r+1],X[k−r+2], . . . ,X[k])  (29)

At any time k, the vector X[k] falls in exactly one of the three assignment regions I, J, and H. Cell assignment of an MS along a given trajectory may be characterized as follows: For k≧1, if the MS is assigned to BS_(i) at time k−1, a handoff to cell j may occur at time k if and only if X[k]εJ. Conversely, if the MS is assigned to BS_(j) at time k−1, a handoff to cell i may occur at time k if and only if X[k]εI. Cell assignment may also be characterized as follows:

Proposition 1: At time k≧1, the MS is assigned to BS_(i) if and only if X[k\k+1]εI₀H^(k) or X[k\r]εIH^(r−1) for some r; 1≦r≦k. Similarly, the MS is assigned to BS_(j) if and only if X[k\k+1]εJ₀H^(k) or X[k\r]εJH^(r−1) for some r, where 1≦r≦k.

Proof: Suppose X[k\r]εIH^(r−1). This condition is equivalent to X[k−r+1]εI and X[l] εH, l=k−r+2, . . . , k. Clearly, the MS is assigned to BS_(i) at time k−r+1. Since no handoff occurs at times l=k−r+2, . . . , k, the MS must also be assigned to BS_(i) at times l=k−r+2, . . . , k. Similarly, if X[k\k+1]εI₀H^(k), then the MS must be assigned to BS_(i) at time k.

Conversely, assume that the MS is assigned to BS^(i) at time k. Then, X[l]εI for some 1≦I≦k or X[l]εI₀ for l=0. Let l* be the largest such 1. Since the MS is assigned to BS_(i) at time k, it must be that X_(l)εH; m=l*; . . . , k. Setting r=k−l*+1, we have the desired result. The case of assignment of MS to BS_(j) at time k may be proved similarly.

Let E_(i)[k] denote the event that the mobile is assigned to base station BS_(i) at time k. E_(i)[k] may be referred as the cell i assignment event at time k. By virtue of Proposition 1, E_(i)[k] may be expressed as follows:

$\begin{matrix} {{E_{i}\lbrack k\rbrack} = {\left\{ {{X\left\lbrack {{k/k} + 1} \right\rbrack} \in {I_{0}H^{k}}} \right\}\bigcup{\underset{r = 1}{\bigcup\limits^{k}}\left\{ {{X\left\lbrack {k/r} \right\rbrack} \in {IH}^{r - 1}} \right\}}}} & (30) \end{matrix}$ For convenience, the following notation is introduced: P _(k)(AH ^(r−1))=Pr{X[k/r]εAH ^(r−1)}, where A may be I, I₀, J, or J₀. Noting that the events on the right-hand side of (30) may be mutually exclusive, we have the following:

Proposition 2: The cell assignment probabilities may be expressed as:

$\begin{matrix} {{{P_{i}\lbrack k\rbrack} = {{\Pr\left( {E_{i}\lbrack k\rbrack} \right)} = {{p_{k}\left( {I_{0}H^{k}} \right)} + {\sum\limits_{r = 1}^{k}\;{p_{k}\left( {IH}^{r - 1} \right)}}}}},} & (31) \end{matrix}$

$\begin{matrix} {{P_{j}\lbrack k\rbrack} = {{\Pr\left( {E_{j}\lbrack k\rbrack} \right)} = {{p_{k}\left( {J_{0}H^{k}} \right)} + {\sum\limits_{r = 1}^{k}\;{p_{k}\left( {JH}^{r - 1} \right)}}}}} & (32) \end{matrix}$ Proposition 2 provides a characterization of the cell assignment probabilities under the discrete-time handoff model.

Handoff probabilities will now be considered. Let E_(ij)[k] denote the event that at time k the cell assignment changes from cell i to cell j, i.e., a handoff may occur from cell i to cell j. Similarly, E_(ji)[k] denotes the event that a handoff may occur from cell j to cell i at time k. The cell handoff events may be expressed as E_(ij)[k] and E_(ji)[k] in terms of the cell assignment events defined earlier as follows: E _(ij) [k]=E _(i) [k−1]∩E _(j) [k] and E _(ji) [k]=E _(j) [k−1]∩E_(i) [k], k≧1  (33) Analogous to Proposition 2, the conditions for a handoff event to occur may be expressed as follows.

Proposition 3: For k≧1, a handoff from i to j may occur at time k if and only if X[k] εJ and X[k−1\r−1]εIh^(r−2) for some r; 2≦r≦k+1 or X[k−1\k]εI₀H^(k−1). Similarly, a handoff from BS_(j) to BS_(i) may occur at time k if and only if X[k] E I and X[k−1\r−1]εJH^(r−2) for some r; 2≦r≦k+1 or X[k−1\k]εJ₀H^(k−1).

Hence, the handoff events E_(ij)[k] and E^(ij)[k] may be expressed as follows:

$\begin{matrix} {{E_{ij}\lbrack k\rbrack} = {\left\{ {{X\left\lbrack {{k \smallsetminus k} + 1} \right\rbrack} \in {I_{0}H^{k - 1}J}} \right\}\bigcup{\underset{r = 2}{\bigcup\limits^{k}}\left\{ {{X\left\lbrack {k \smallsetminus r} \right\rbrack} \in {{IH}^{r - 2}J}} \right\}}}} & (33) \end{matrix}$

$\begin{matrix} {{{E_{ij}\lbrack k\rbrack} = {\left\{ {{X\left\lbrack {{k \smallsetminus k} + 1} \right\rbrack} \in {J_{0}H^{k - 1}I}} \right\}\bigcup{\underset{r = 2}{\bigcup\limits^{k}}\left\{ {{X\left\lbrack {k \smallsetminus r} \right\rbrack} \in {{JH}^{r - 2}I}} \right\}}}},{k \geq 1}} & (34) \end{matrix}$ Since the events on the right-hand sides of (34) and (35) are mutually exclusive, the following characterization of the cell handoff probabilities, analogous to Proposition 2, may be made:

Proposition 4: The cell handoff probabilities may be expressed as follows:

$\begin{matrix} {{P_{ij}\lbrack k\rbrack} = {{\Pr\left( {E_{ij}\lbrack k\rbrack} \right)} = {{p_{k}\left( {I_{0}H^{k - 1}J} \right)} + {\sum\limits_{r = 2}^{k}\;{{p_{k}\left( {{IH}^{r - 2}J} \right)}k}}}}} & (36) \end{matrix}$

$\begin{matrix} {{{P_{ji}\lbrack k\rbrack} = {{\Pr\left( {E_{ji}\lbrack k\rbrack} \right)} = {{p_{k}\left( {J_{0}H^{k - 1}I} \right)} + {\sum\limits_{r = 2}^{k}\;{p_{k}\left( {{JH}^{r - 2}I} \right)}}}}},{k \geq 1}} & (37) \end{matrix}$

An important performance measure to estimate the context of a cell assignment model is the mean number of handoffs that occur as the mobile moves along a given trajectory. Let N_(ho) denote the number of handoffs that occur for a mobile moving along a given trajectory. Let 1^(E) denote the indicator function for the event E. The number of handoffs may then be expressed as follows:

$\begin{matrix} {N_{ho} = {\sum\limits_{k = 1}^{M}\;\left( {1_{E_{ij}{\lbrack k\rbrack}} + 1_{E_{ji}{\lbrack k\rbrack}}} \right)}} & (38) \end{matrix}$

Hence, the mean number of handoffs may be given by

$\begin{matrix} {{E\left\lbrack N_{ho} \right\rbrack} = {\sum\limits_{k = 1}^{M}\;\left( {{\Pr\left( {E_{ij}\lbrack k\rbrack} \right)} + {\Pr\left( {E_{ji}\lbrack k\rbrack} \right)}} \right)}} & (39) \end{matrix}$

Recursive procedure for handoff analysis will now be considered. For handoff algorithms based on relative signal strength, the handoff behavior of the MS may map to the one-dimensional process X[k]. In this case, the assignment regions may be intervals of the real-line: I=[h_(i); ∞],. J=[−∞; h_(j)], and H=(−h_(j); h_(i)). The assignment regions at system initialization time may be I₀=(0,∞) and J₀=(−∞; 0). The expressions derived earlier for assignment and handoff probability map straightforwardly to the one-dimensional case. In the one-dimensional case, equation (31) may express the cell assignment probability to BS_(i) at time k as a summation of probabilities of the form p_(k)(IH^(r−1)).

A recursive procedure for evaluating these probabilities will now be developed. For convenience, X[k] may be denoted by X_(k). A sequence of bivariate functions {g_(k)(x_(k-1),x_(k)), k≧1} may be defined as follows: g ₁(x ₀,x₁)=fx ₀ x ₁(x ₀,x₁)  (40) g ₂ (x ₁,x₂)=∫_(I) ₀ g ₁(x ₀,x₁)f _(x) ₂ _(|x) ₀ _(x) ₁ (x ₂ |x ₀,x₁)dx ₀  (41)

$\begin{matrix} \begin{matrix} {{g_{2}\left( {x_{k - 1},x_{k}} \right)} = {{\int_{I}{{fx}_{k - 2}{x_{k - 1}\left( {x_{k - 2},x_{k - 1}} \right)}{fx}_{k}\left. {{x_{k - 2}{x_{k - 1}\left( x_{k} \right.}x_{k - 2}},x_{k - 1}} \right){\mathbb{d}x_{k - 2}}}} +}} \\ {{= \left. {\int_{H}{{g_{k - 1}\left( {x_{k - 2},x_{k - 1}} \right)}{fx}_{k}}} \middle| {x_{k - 2}{x_{k - 1}\left( {\left. x_{k} \middle| x_{k - 2} \right.,x_{k - 1}} \right)}{\mathbb{d}x_{k - 2}}} \right.},{k \geq 3}} \end{matrix} & (42) \end{matrix}$

Here, fx_(k−1)x_(k)(x_(k−1),x_(k)) is the joint density of {X[k−1],X[k]} and fx_(k)|x_(k-2)x_(k-1)(x_(k)|x_(k-2),x_(k-1)) is the conditional density of X[k], given X[k−1] and X[k−2]. Expressions for the conditional joint densities may be derived by those skilled in the art. The notation ∫_(A) denotes the standard Riemann integral over the set A. The bivariate functions g_(k) have the following useful property:

Lemma 1: For k≧2,

$\begin{matrix} {G_{k} = {{\int_{H}{\int_{H}{{g_{k}\left( {x_{k - 1},x_{k}} \right)}\ {\mathbb{d}x_{k}}\ {\mathbb{d}x_{k - 1}}}}} = {{p_{k}\left( {I_{0}H^{k}} \right)} + {\sum\limits_{r = 3}^{k}\;{p_{k}\left( {IH}^{r - 1} \right)}}}}} & (43) \end{matrix}$

With these definitions, the probability of cell assignment to BS_(i) may be expressed as follows (the corresponding result for the probability of assignment to BS_(j) being analogous):

Proposition 5: p _(i) [k] p _(k)(I)+p _(k)(IH)+∫_(H)∫_(H) g _(k)(x _(k-1),x_(k))dx _(k) dx _(k−1),k≧2,  (44) p_(i)[1]=p ₁(I)+p ₁(I ₀ H),  (45) P _(i)[0]=p ₀(I ₀)  (46)

The probabilities p_(k)(I) and p_(k)(IH) may be given as follows: p _(k)(I)=∫_(I) fx _(k)(x _(k))dx _(k), k≧0  (47) p _(k)(IH)=∫_(I)∫_(H) fx _(k-1) x _(k)(x _(k−1),x_(k))dx _(k) dx _(k−1),k≧1.  (48)

Proof: Eqs. (46) and (45) follow directly from Proposition 2 when k=0 and k=1, respectively. For k≧2, Eq. (44) follows from Proposition 2 and Lemma 1.

The handoff probability from BS_(i) and BS_(j) may be expressed similarly in terms of the functions g_(k) (the corresponding result for the probability of handoff from BS_(j) to BS_(i) being analogous):

Proposition 6: p _(ij) [k] p _(k)(IJ)∫_(H)∫_(J) g _(k)(x _(k−1), x_(k))dx _(k) dx _(k-1),k≧2,  (49) p _(ij)[1]=p ₁(I ₀ J).  (50)

The probability p_(k)(IJ) may be given as follows: p _(k) [IJ]=∫ _(I)∫_(J) fx _(k-1) x _(k)(x _(k-1),x_(k))dx _(k) dx _(k-1),k≧1.  (51)

A methodology for characterizing handoff performance over arbitrary mobile trajectories in a cellular network having a regular hexagonal cell pattern will now be disclosed. It is envisioned that this approach may be extended to networks with other types of regular cell structure. FIG. 6 illustrates an example of a mobile trajectory inside a wireless network covered by hexagonal cells. In the hard handoff scheme, at a given location, only the two base stations closest to the mobile unit are involved in the cell assignment process. (Of course, in a soft handoff scheme, more that two base stations would be involved). The two base stations preferably define a rhombus in which the major diagonal is a line segment joining the two base stations. This rhombus may be referred to as a minimum geometric structure (MGS).

For the purposes of modeling and analyzing hard handoff performance, an arbitrary trajectory may be mapped into a single instance of an MGS. In order to accomplish this, the concept of a reduced geometric structure (RGS) is introduced first. As shown in FIG. 7, an RGS may be a star-shaped object consisting of a hexagonal cell at the center and six triangular regions subtending the edges of the hexagon. The mapping of the cellular network into a single MGS may be performed in two steps:

-   -   1. translation of all path segments into a single reduced         geometric structure (RGS); and

2. rotation of all path segments within the RGS into a single MGS.

In the hexagonal cellular network, the RGS preferably has the shape of a star, with a base station at the center and six neighboring base stations situated at the vertices of the star. The RGS may be viewed as consisting of six MGSs, one corresponding to each of the vertices.

The mapping of a mobile trajectory in a cellular network into an RGS is illustrated in FIGS. 6 and 7. In FIG. 6, base station BS, lies at the center of an RGS that is chosen as the base RGS. The mobile trajectory begins at location r₀ in the RGS centered at BS₁ and enters the RGS centered at BS₃, at location r₂. Since the path segment r₀r₂ lies entirely within the base RGS, no translation may be required. The path segment r₂r₅ lies within the RGS centered at BS₃ and should be translated to the base RGS. This may be done by translating the RGS centered at BS₃ to the RGS centered at BS₁. FIG. 7 shows the segments of the original trajectory that have been translated to the base RGS. For example, the path segment r₂r₅, originally lying within the RGS centered at BS₃ in FIG. 6 has been translated to its corresponding position within the base RGS in FIG. 7. Similarly, the path segment r₅r₆, originally lying within the RGS centered at BS₄ has been translated to its corresponding position in the base RGS in FIG. 7. Thus, FIG. 7 shows a representation of the original mobile trajectory in the cellular network that has been mapped to a single base RGS via translation.

The trajectory segments shown in the base RGS of FIG. 7 may be further mapped into an MGS via rotations. The RGS in FIG. 7 consists of six rhombi corresponding to the vertices of the RGS. The rhombus corresponding to the leftmost vertex of the RGS to serve as the base MGS may be chosen. The remaining five MGSs may each be rotated in turn to coincide with the base MGS. Within an MGS, a trajectory that passes from one boundary to another may be approximated by a line segment. As shown in FIG. 9, the segment r₁r₂ may be characterized uniquely by the crossing point located at the distance d from O₀ and the angle α, which it forms with (O₀O₂). A set of line segments within the MGS may be generated by the parameter pair (d; α) over the range (0; d_(max))×(0; π) using a particular step pair (δ_(d); δ_(α)). The overall handoff performance within a cellular network may be characterized in terms of the mean number of handoffs along each segment in the set of generated line segments.

Numerical evaluations of handoff performance obtained using embodiments of the present invention will now be discussed. Comparisons were made with results obtained from Monte Carlo simulation as well as the alternative analytical approaches mentioned earlier. First we evaluate the cell assignment and handoff probabilities along two representative trajectories Tr₁ and Tr₂ shown in FIG. 9. Within the minimum geometric structure of FIG. 9, the trajectories Tr₁ and Tr₂ are characterized by the parameter pairs (d₁; α₁)=(0; 0) and (d₂; α₂)=(1000; π/4), respectively. Also evaluated is the impact of the hysteresis parameter h on the mean number of handoffs and the crossover point for the two trajectories. Finally, handoff performance over the set of straight-line trajectories generated within a minimum geometric structure is evaluated.

Numerical results may be obtained using an embodiment implemented in MATLAB of the recursive procedure described earlier. The implementation represents the bivariate function g_(k)(x_(k-1),x_(k)) as a matrix over a finite grid of points in two-dimensional space. The integrals that appear in the recursive procedure are approximated by trapezoidal integration. The numerical procedure may be made arbitrarily more accurate by using a larger matrix corresponding to a grid of higher granularity, but at the expense of greater storage requirement and higher computational cost. The procedure computes assignment probabilities to an error of less than 10⁻⁶. The overall computational complexity of the procedure at each iteration is O(h₂), where h is the hysteresis parameter. It is believed that this implementation is more efficient than Monte Carlo simulation for an equivalent level of accuracy.

For the illustrative numerical computations presented, the main system parameters were set as follows: D=2000 m, v_(i)=0 dB, u_(i)=30 dB, σw_(i)=6 dB, d_(o)=20 m, d_(s)=1 m. The decay distance of the smoothing window d_(av) was set to 10 m. For comparison purposes, numerical results obtained using the following alternative approaches to the handoff performance evaluation are also shown:

Monte Carlo simulation;

Poisson approximation model of Vijayan and Holtzman; and

Approximate discrete-time model of Zhang and Holtzman.

FIG. 10 shows the probability that the mobile station is assigned to base station BS_(i) as a function of the sampled distance along the trajectory Tr₁ when the hysteresis parameter is set to h=1. The curve obtained from the present model matches closely that obtained from the Monte Carlo simulation. Since the mobile begins at BS_(i), the assignment probability is initially 1 and then decreases monotonically to 0 as it approaches BS_(j) along the straight-line trajectory. The cell assignment probability along Tr₁ obtained using the Vijayan-Holtzman model is also plotted in FIG. 10. The assignment probabilities obtained from the Vijayan-Holtzman model show inaccuracies, and a bias may be seen in the crossover point. For relatively small hysteresis levels, the Vijayan-Holtzman model does not appear to provide a good estimate for the crossover point and the mean number of handoffs. Similar observations may be made with respect to FIG. 11, which shows the assignment probability to base station BS_(i) as the mobile station moves along the trajectory Tr₂ for a hysteresis value of h=1.

Observe in FIG. 10 that the crossover point is approximately equal to the halfway point along the trajectory, i.e., 1000 m. The ideal assignment probability curve along the trajectory Tr₁ is a step function with a step discontinuity from the level 1 to the level 0 at the halfway point. As the hysteresis level h is increased, the assignment probability curve more closely approximates a step function as may be seen in FIG. 12. However, in this case, as the value of the crossover point increases, a larger handoff delay is implied. Therein lies a critical tradeoff in dimensioning the parameter h for hysteresis-based handoff algorithms.

Comparing the Vijayan-Holtzman results in FIGS. 10 and 12, the results may become more accurate as h is increased. As noted by Vijayan and Holtzman, the Poisson model is asymptotically accurate as the value of the parameter h is increased. However, as shown in FIG. 13, even when h=10, a discrepancy may be observed between the assignment probability curve from the Vijayan-Holtzman model and that from simulation and this analysis. Also note that there is significant error in the first couple of hundred meters, which is approximately the radius of a microcell. This is most likely because the model does not take into account the transient behavior due to system initialization when the MS becomes active. This effect is more pronounced for larger h.

FIG. 14 shows the probability of the mobile station being handed off from BS_(i) to BS_(j) as it moves along trajectory Tr₁ when the hysteresis parameter is set to h=3. The simulation results are shown along with 95% confidence intervals. The curve obtained from our analysis agrees closely with the simulation curve, whereas the curve obtained from the Vijayan-Holtzman model underestimates the handoff probabilities.

Similar observations may be made with respect to FIG. 15, which shows the handoff probabilities for the mobile station moving along trajectory Tr₂. For both trajectories, the handoff probability increases to a maximum value near the crossover point. It should further be noted that for small values of the handoff probabilities, a large number of simulations may be required, making the present analytical approach an attractive alternative to simulation.

A main performance measures used in the design and optimization of the 2G wireless networks are the mean number of handoffs and the crossover point. In FIG. 17, the mean number of handoffs for a mobile station moving along trajectory Tr₁ is plotted as a function of the hysteresis parameter h using the four methods discussed above. The present analytical results agree closely with those obtained from Monte Carlo simulation. Note that the Zhang-Holtzman model overestimates the mean number of handoffs over almost the entire range of hysteresis values. The Vijayan-Holtzman model underestimates the mean number of handoffs when h is less than 5, while for h>5, this model shows close agreement with the present model and Monte Carlo simulation. However, as shown in FIG. 16, the Vijayan-Holtzman model does not capture the transient handoff behavior at the beginning of the MS trajectory for the first couple of hundred meters.

FIG. 19 plots the crossover point as a function of the hysteresis parameter for the mobile station moving along trajectory Tr₁. FIG. 20 shows the corresponding results for Tr₂. In both figures, results from simulation and the analytical model are shown. The general trend is that the crossover point increases as the hysteresis level increases. Thus, larger hysteresis levels result in larger delays in handoff. On the other hand, as observed earlier, the mean number of handoffs decreases with increasing hysteresis level. Depending on the application, different tradeoffs between the mean number of handoffs and the crossover point may be desirable. The hysteresis parameter should be chosen accordingly.

In general, it is desirable to minimize the number of handoffs while having as small a handoff delay as possible. A small handoff delay may be particularly important for the design and dimensioning of 3G systems, since the allocated bandwidth is significantly larger than for 2G systems. As seen earlier, small handoff delay may be achieved by using small values for the hysteresis parameter. On the other hand, small hysteresis levels may imply a larger number of handoffs. The tradeoff between crossover point and mean number of handoffs for trajectories Tr₁ and Tr₂ is illustrated explicitly in FIGS. 21 and 22, respectively. In both figures, the optimum operating point will typically lie in the neighborhood of the knee of the curve.

Using the minimum geometric structure introduced earlier (see FIG. 9), the mean number of handoffs for a cellular network with hexagonal structure may be characterized as a surface. In particular, we characterize the mean number of handoffs over a set of line segments within a minimum geometric structure (O₀O₁O₂O₃).

The set of line segments for the set of line segments generated by the following set of relations may be shown as: {(d,α)ε(0,2000)×(0,π);(d _(c),α)=k(δ_(d) _(c) ,δ_(α)),k=0,1, . . . }  (53)

FIGS. 23 and 24 show the mean number of handoffs obtained from this handoff model over the set of straight-line trajectories within a minimum geometric structure when the hysteresis parameter h is set to 1 and 3, respectively. For these figures, the set of segments was generated using (53) with

$\left( {\delta_{d_{c}},\delta_{\alpha}} \right) = {\left( {100,\frac{\pi}{18}} \right).}$ In FIGS. 23 and 24, the mean number of handoffs may achieve a maximum when d_(c)=1000 and α=π2, which corresponds to the trajectory Tr₃ along the cell boundary between BS_(i) and BS_(j). For this particular trajectory, the mean number of handoffs is about 12 when h=1 and about 6 when h=3. As h is increased, the entire surface becomes lower, though not in a uniform manner.

Each surface summarizes the handoff performance over the cellular network for a particular hysteresis value. As discussed earlier, an arbitrary trajectory in the network may be obtained by approximating the trajectory with a set of straight-line trajectories within a minimum geometric structure. The mean number of handoffs along the trajectory may then be obtained using surfaces such as those shown in FIGS. 23 and 24. These surfaces provide a convenient means for visualizing the overall signaling load due to handoffs in the network.

A main contribution of the present invention is a rigorous discrete-time framework for modeling and analyzing handoff performance in cellular networks. Based on the discrete-time framework, expressions may be derived for the probabilities of cell assignment and handoff along arbitrary straight-line trajectories. An efficient numerical procedure may then be developed for accurately evaluating the performance measures for handoff algorithms based on relative signal strength. By introducing the concept of a minimum geometric structure, a characterization of handoff performance over a wide range of possible mobile trajectories is developed. This invention finds direct application to the design and dimensioning of handoff algorithms in general and more specifically in hard handoff algorithms in cellular networks based on the GSM and GPRS standards.

In recent years, some novel handoff algorithms have been proposed in the research literature. For example, some algorithms formulate a locally optimal handoff algorithm to obtain the best tradeoff between expected number of service failures and expected number of handoffs. Other algorithms suggest the use of neural networks for handoff algorithms. Such algorithms may result in nonlinear assignment regions (cf. FIG. 4). In principle, nonlinear assignment regions are accommodated in the presently disclosed discrete-time framework, but the numerical evaluation of the assignment and handoff probabilities in this case may be computationally challenging. The same remark applies to handoff algorithms that use both relative and absolute signal strengths (cf. FIG. 3).

The numerical procedure developed for the present handoff mechanisms may be efficient for relatively small values of the hysteresis parameter h, but its complexity grows as O(h²). This complexity is due to the second-order Markov property of the processed signal strength {X[k]}. By contrast, the raw signal strength {Y[k]} may be characterized as a first-order Markov chain. The higher order of the Markov chain {X[k]} may be due to the averaging filter f_(av)[k], which is used to eliminate fast fading. An alternative technique may be to eliminate fast fading while preserving the first-order Markov property of the raw signal strength. In this case, the handoff analysis may be performed more efficiently than with conventional averaging.

Although the present invention has been described illustratively in the case of hard handoff, the discrete-time handoff model may be extended to the case of soft handoff. For example, it is envisioned that the present invention may be applied to soft handoffs and the design of packet-switched CDMA networks that exploit macro-diversity.

Another illustrative embodiment of the invention which focuses specifically on soft handoff in IS-95 will be presented. This software handoff mechanism may be characterized by three basic parameters: an add threshold T_(a), a drop threshold T_(d), and a drop timer τ_(d). As the mobile unit moves in the network, it may sample received pilot signal strengths from base stations in its close vicinity, which may form a neighbor set, N_(k), where k is the discrete-time sampling index. Among the base stations in N_(k), some belong to the active set, A_(k), and others to the candidate set, C_(k). The candidate set is the set of neighbor base stations not in the active set with pilot signals of sufficient strength for the mobile unit to demodulate the associated forward traffic channels. A base station in the candidate set enters the active set if its pilot signal strength exceeds T_(a). A base station currently in the active set leaves the active set if its pilot signal strength drops below T_(d) for a period of time exceeding τ_(d).

A cell assignment model will now be discussed. The assignment of cell i to the mobile unit's active set may be determined by the time-evolution of the received signal strength process Y_(i)(t). In IS-95 CDMA networks, cell i is preferably added to the mobile's active set when the value of Y_(i)(t) exceeds the add threshold T_(a). Cell i may then be removed from the active set when Y_(i)(t) falls below the drop threshold T_(d) for an interval of at least τ_(d) seconds. In the discrete-time framework, the cell assignment decision may be based on the process Y_(i)[k]. Cell i may be dropped from the active set when the value of Y_(i)[k] is less than T_(d) for M consecutive discrete-time instants, where M=┌τ_(d)/τ_(s)┐. The parameters T_(a), T_(d), and M may determine the soft handoff algorithm. In general, these parameters may also depend on the cell i.

An illustrative soft handoff embodiment of the present invention will now be discussed. A real line may be partitioned into three disjoint intervals defined as follows: A=[T _(a),∞),H=(T _(d),T_(a)),D=(−∞,T_(d)],  (54) where A is the assignment region, H is the hysteresis region, and D is the drop region. If Y_(i)[k]εA, then cell i should be assigned to the active set at time k, i.e., iεA_(k). Let Y_(i)[k\r] denote the vector consisting of the r most recent values of Y_(i)[k] up to and including time k: Y _(i) [k\r]=(Y _(i) [k−r+1], . . . , Y _(i) [k])  (55)

A soft handoff rule at time k≧1 may be expressed as follows: If cell i is not in the active set at time k−1, it may enter the active set at time k if and only if Y_(i)[k]εA. Conversely, if cell i is not in the active set at time k−1, it may leave the active set at time k if and only if Y_(i)[k\M]εD^(M). Cell i may be assumed not to be in the active set at time k=0.

It is convenient to characterize the received signal strength in terms of the regions A, H, and D. Specifically, the received signal Y^(i)[k] may be mapped to a letter S^(i)[k] defined on the alphabet S={A,H,D}. Let S^(n) denote the set of strings of length n over the alphabet S. The cardinality of S^(n) is preferably 3″. Let S⁺ denote the set of all finite length strings over the alphabet S, i.e., S⁺=∪_(n=1) ^(∞)S^(n).

Let E_(i)[k] denote the event that cell i is assigned to the active set at time k. The complementary event, Ē_(i)[k] should be the event that at time k cell i is not assigned to the active set. Then the cell non-assignment event, Ē_(i)[k], preferably occurs if and only if one of the following conditions holds: Y _(i) [k]εA for n=1, . . . ,k, or  (56) Y _(i) [n\M]εD _(M) for some n,M≦n≦k and Y _(i[)1]εA for n<1≦k.  (57)

Let B_(k) denote the set of strings of length k over the alphabet S that do not contain the character A. B_(k) may be expressed as B_(k)={H, D}^(k). The first condition for cell non-assignment may be formulated in terms of the string S_(i)[k\k] as follows: S _(i) [k\k]εB _(k)  (58)

Let H_(k) denote the set of strings of length k that do not contain the sub-string D^(M) or the character A. The set H^(k) may be expressed as follows: H _(k) =B _(k) ∪{H,HD,HD ² , . . . , HD ^(M−1)}⁺  (59) The second condition for cell non-assignment may then be formulated as follows: S _(i) [k\r]εD ^(M) H ^(r−M) for some r, M≦r≦k.  (60) The conditions (58) and (59) may be combined to express Ē_(i)[k] as a union of disjoint events:

$\begin{matrix} {{{\overset{\_}{E}}_{i}\lbrack k\rbrack} = {\left\{ {{S_{i}\left\lbrack {k \smallsetminus k} \right\rbrack} \in B_{k}} \right\}\bigcup{\underset{r = M}{\bigcup\limits^{k}}\left\{ {{S_{i}\left\lbrack {k \smallsetminus r} \right\rbrack} \in {D^{M}H_{r - M}}} \right\}}}} & (61) \end{matrix}$ For a string sεS⁺ of length |s|≦k, the following notation may be introduced: p _(k,i)(s)=P{Y _(i) [k\|s|]εs}.  (62)

Thus, p_(k,i)(s) may represent the probability that the last |s| values of the sequence Y_(i)[k\k] fall in the regions defined by the strings. The probability that cell i is assigned to the active set may be denoted by P_(i)[k]=P{E_(i)[k]}. Similarly, the probability that cell i is not assigned to the active set may be denoted by P _(i)[k]=P{Ē_(i)[k]}. Now, P_(i)[k]+ P _(i)[k]=1 for all k≧0.

The characterization of cell non-assignment in (61) may imply the following result.

Proposition 7:

$\begin{matrix} {{{\overset{\_}{P}}_{i}\lbrack k\rbrack} = {{\sum\limits_{s \in B_{k}}\;{p_{k,i}(s)}} + {\sum\limits_{r = M}^{k}\;{\sum\limits_{s \in {D^{M}H_{r - M}}}\;{p_{k,i}(s)}}}}} & (63) \end{matrix}$

Proposition 7 provides the basis for the numerical evaluation of the cell assignment probabilities. From the cell assignment probabilities, a number of handoff performance measures may be obtained. The outage probability is the probability that the active set is empty and may be given by:

$\begin{matrix} {{{P_{o}\lbrack k\rbrack} = {\prod\limits_{i \in N_{k}}\;{{\overset{\_}{P}}_{i}\lbrack k\rbrack}}},} & (64) \end{matrix}$ where N_(k) is the set of neighbor cells. The mean size of the active set or macrodiversity degree may be given by:

$\begin{matrix} {{\overset{\_}{N}}_{d} = {\frac{1}{K}{\sum\limits_{k = 1}^{K}\;{\sum\limits_{i \in N_{k}}\;{{P_{i}\lbrack k\rbrack}.}}}}} & (65) \end{matrix}$

An efficient recursive procedure for evaluating the non-assignment probabilities given in Proposition 7 will now be presented. To that end, a family of M−1 sequences of functions may be defined as: h _(k) ^([m]) :D→

⁺ ,k≧1,1≦m≦M−1,  (66) where

may denote the real line, as follows:

$\begin{matrix} {{{h_{k}^{\lbrack 1\rbrack}(y)} = {\int_{D}{{f_{k - 1}(z)}{f_{k}\left( {y❘z} \right)}\ {\mathbb{d}z}}}},{{h_{k - m}^{\lbrack m\rbrack}(y)} = {\int_{D}{{h_{k - m - 1}^{\lbrack{m - 1}\rbrack}(z)}{f_{k}\left( {y❘z} \right)}\ {\mathbb{d}z}}}},{m = 2},\ldots\mspace{14mu},{M - 1},} & (67) \end{matrix}$ with the initialization condition: h _(k) ^([m])(y)=0 for all yεD if m<k.  (68)

Here, f_(k)(x) may denote the marginal density of Y[k] and f_(k)(x|z) may denote the conditional density of Y[k] given that Y[k−1]=z. These densities are preferably Gaussian. By further observing that Y[k] is most likely a first-order Markov chain, one may show that: p _(k)(D ^(M))=∫_(D) h _(k) ^([M−1)](y)dy.  (69)

Next, we define a sequence of functions: g_(k):H→

⁺ and g_(k) ^([m]):D→

⁺,  (70) for m=1, . . . , M−1. For k≧2, q_(k): D→

⁺ may be defined as follows:

$\begin{matrix} {{q_{k}(y)} = {{h_{k}^{\lbrack{M - 1}\rbrack}(y)} + {\sum\limits_{m = 1}^{M - 1}\;{{g_{k}^{\lbrack m\rbrack}(y)}.}}}} & (71) \end{matrix}$ Next, for k≧1 define: q _(k)(y)=∫_(D) q _(k−1)(z)f _(k)(y|z)dz+g _(k) ^([1])(y)  (72) where q _(k) ^([1])(y)=∫_(D) q _(k−1)(z)f _(k)(y|z)dz,  (73) and q _(k) ^([r])(y)=∫_(H) q _(k−1) ^([r−1])(z)f _(k)(y|z)dz,  (74) for r=2, . . . , M−1. The initialization conditions may be: q ₀(y)=f ₀(y) and g _(k) ^([m])(y)=0 for k<m.  (75)

With the above definitions, the cell non-assignment probabilities may be expressed as follows.

Proposition 8: P _(i) [k]=∫ _(D) q _(k)(y)dy+∫ _(H) g _(k)(y)dy  (76)

Proof: (Sketch) The proof is by induction on k. One shows that for each k, the right-hand-side of (76) is equivalent to the expression given in Proposition 7. In doing so, one uses the fact, noted earlier, that Y[k] may be a first-order Markov chain.

FIG. 25 illustrates a possible cellular network and a mobile trajectory along the straight line directed from BS₁ to BS₃. In this example, the distance between two neighboring base stations is D=2000 m. The candidate set is C={1,2,3,4}. Cell assignment probabilities and the outage probabilities as functions of the discrete-time parameter k for a mobile unit traveling along trajectory in FIG. 1 may be calculated using the present invention. These analysis may be performed using an implementation of the recursive procedure of Proposition 8 in MATLAB.

In order to study the mean macrodiversity degree for arbitrary trajectories in the cellular network, a family of straight-line segments directed from a fixed origin 0 may be considered as shown in illustrative FIG. 26. In this illustrative example, the segments all have length d_(r). The starting point and orientation of each segment is specified by the pair (d,α), where d is the radial distance from the origin O and α is the angle of the segment with respect to the reference axis OX. Equivalently, the pair (d, α) may be expressed in Cartesian coordinates as (d_(X),d_(Y)), where d_(X)=d cos α and d_(Y)=d sin α.

This illustration of a software handoff embodiment of the present invention shows a new discrete-time modeling and analysis technique to evaluate the performance of soft handoff analysis for mobile units traveling along an arbitrary trajectory in a cellular CDMA. An advantage of this embodiment is that it provides for a recursive computational procedure to evaluate the cell assignment probabilities efficiently and accurately. This analytical approach is advantageous to computer simulation both in accuracy and in efficiency, particularly in calculating outage probabilities. This invention may also be used to dimension and optimize soft handoff algorithms for CDMA networks. Numerical results for a cellular network with hexagonal cells show that the value of the drop timer parameter, τ_(d), may have a significant effect on the mean macrodiversity degree. It is envisioned that this soft handoff analysis system could be used to evaluate the achievable macrodiversity gain of cellular network architectures for a variety of indoor and outdoor propagation models.

FIG. 27 shows a flow diagram of an embodiment of an aspect of the present invention. This flow diagram represents basic steps that may be taken to practice an embodiment of the present invention. One skilled in the art will recognize that other sequences may be performed in accordance with the principals taught in this disclosure. At step S2710, a description on a cellular network may be created. This description should represent the network where handoff decision mechanisms are to be studied. A description as per this invention may include elements such as a cellular network geometry; a signal propagation description; a description of network base stations, and a description of network mobile units. The network base stations may be further described using elements such as the base stations location within said cellular network geometry and the base stations pilot signal strength. The mobile unit(s) preferably are capable of moving along a trajectory and sampling pilot signal strengths.

At step S2720, a reduced geometric structures may be created from the reference cellular network description. A representation of a general trajectory for a mobile unit traveling in the cellular network may be generated at step S2730. Next, at step S2740, a piecewise path may be approximated from the general trajectory representation. Next, a handoff mechanism may be selected at step S2750 and handoff parameters selected at step S2760. Examples of handoff mechanisms include hard handoff mechanisms and soft handoff mechanisms. Examples of handoff parameters include: hysteresis values; drop timer values; averaging parameters; and handoff decision intervals.

A discrete-time formulation may then be created at step 2770. This discrete-time formulation preferably characterizes handoff behaviors. Finally, handoff performance metric(s) may be calculated at step S2780. These metrics may include: an assignment probabilities; a handoff probabilities; mean number of handoff value(s); crossover point(s); outage probabilities; macrodiversity degrees; and overall signaling loads incurred by the handoff mechanism.

FIG. 28 shows a block diagram of an embodiment of an aspect of the present invention. This block diagram represents basic elements that may be used to practice an embodiment of the present invention. One skilled in the art will recognize that other elements may be used in accordance with the principals taught in this disclosure. The cellular network modeler 2800 preferably includes: a cellular network generator 2810; a reduced geometric structure creator 2820; a general trajectory generator 2830; a piecewise path creator 2840; a handoff mechanism selector 2850; a handoff parameter selector 2860; a discrete-time formulation creator 2870; and a handoff metric calculator 2880. The cellular network generator 2810 should be capable of generating a description of a reference cellular network to be studied as previously discussed. The reduced geometric structure creator 2820 is preferably capable of creating reduced geometric structures from a reference cellular network description. The general trajectory generator 2830 is preferably capable of representing a general trajectory for a mobile unit in a reference cellular network description. The piecewise path creator 2840 is preferably capable of approximating a general trajectory with a piecewise path having a multitude of handoff decision points. The handoff mechanism selector 2850 is preferably capable of selecting for analysis a handoff mechanism such as a hard handoff mechanism or a soft handoff mechanism. The handoff parameter selector 2860 is preferably capable of selecting for use in handoff analysis parameters such as hysteresis values; drop timer values; averaging parameters; and handoff decision intervals. The discrete-time formulation creator 2870 is preferably capable of creating a discrete-time formulation such as previously described. And finally, the handoff metric calculator 2880 is preferably capable of calculating performance handoff metrics such as: assignment probabilities; handoff probabilities; mean number of handoff value(s); crossover point(s); outage probabilities; macrodiversity degrees; and overall signaling loads incurred by the handoff mechanism.

It is envisioned that each of these elements may be implemented using digital hardware with or without microprocessor assistance. In one embodiment, the elements may all be modules operating within a single computer. However, to speed up results, the modules may be split into separate computers that are networked. For certain modules, it will likely be advantageous to implement their functions using signal processing.

The foregoing descriptions of the preferred embodiments of the present invention have been presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed, and obviously many modifications and variations are possible in light of the above teaching. The illustrated embodiments were chosen and described in order to best explain the principles of the invention and its practical application to thereby enable others skilled in the art to best utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated. 

1. A method for evaluating the performance of cellular network handoff decisions comprising the steps of: a) creating a reference cellular network description, said reference cellular network description describing: i) a cellular network geometry; ii) a signal propagation description; iii) at least two base stations, each of said at least two base stations having: (1) a location within said cellular network geometry; and (2) a pilot signal having a pilot signal strength; and iv) at least one mobile unit capable of: (1) moving along a trajectory; and (2) sampling said pilot signal strength; and b) creating reduced geometric structures from said reference cellular network description; c) representing a general trajectory for said mobile unit in said reference cellular network description; d) approximating said general trajectory with a piecewise path having a multitude of handoff decision points; e) selecting a handoff mechanism; f) selecting handoff parameters; g) creating a discrete-time formulation characterizing handoff behaviors; and h) calculating at least one handoff performance metric along at least one said handoff decision point.
 2. A method according to claim 1, wherein at least one of said at least one handoff performance metric includes: a) an assignment probability; b) a handoff probability; c) a mean number of handoff value; d) a crossover point; e) an outage probability; f) a macrodiversity degree; and g) an overall signaling load incurred by said handoff mechanism.
 3. A method according to claim 1, wherein said cellular network geometry includes at least one of the following: a) a hexagonal cell pattern; b) a diamond cell pattern; c) a square cell pattern; d) a rhombus cell pattern; and e) a star pattern.
 4. A method according to claim 1, wherein said cellular network geometry includes cells mapped into at least one reduced geometric structure.
 5. A method according to claim 4, wherein said cellular network geometry includes reduced geometric structures mapped into at least one minimum geometric structure.
 6. A method according to claim 1, wherein said signal propagation description includes at least one of the following components: a) a path loss component; b) a shadow fading component; and c) a fast fading component.
 7. A method according to claim 1, wherein said piecewise path is a piecewise linear path.
 8. A method according to claim 1, wherein said step of selecting a handoff mechanism includes selecting a hard handoff mechanism.
 9. A method according to claim 1, wherein said step of selecting a handoff mechanism includes selecting a soft handoff mechanism.
 10. A method according to claim 1, wherein said step of selecting a handoff mechanism considers at least one of the following: a) assignment regions; b) relative pilot signal strengths; and c) relative processed signal strengths.
 11. A method according to claim 1, wherein said handoff parameters include at least one of the following: a) a hysteresis value; b) a drop timer value; c) an averaging parameter; and d) a handoff decision interval.
 12. A method according to claim 1, wherein said step of calculating at least one handoff performance metric along at least one said handoff decision point uses a recursive procedure.
 13. A cellular network handoff modeler comprising: a) a reference cellular network description generator, capable of generating a reference cellular network description, said reference cellular network description describing: i) a cellular network geometry; ii) a signal propagation description; iii) at least two base stations, each of said at least two base stations having: (1) a location within said cellular network geometry; and (2) a pilot signal having a pilot signal strength; and iv) at least one mobile unit capable of: (1) moving along a trajectory; and (2) sampling said pilot signal strength; and b) a reduced geometric structure creator, capable of creating reduced geometric structures from said reference cellular network description; c) a general trajectory generator, capable of representing a general trajectory for said mobile unit in said reference cellular network description; d) a piecewise path creator capable of approximating said general trajectory with a piecewise path having a multitude of handoff decision points; e) a handoff mechanism selector; f) handoff parameters selector; g) a discrete-time formulation creator capable of characterizing handoff behaviors; and h) a handoff performance metric calculator capable of calculating at least one handoff performance metric along at least one said handoff decision point.
 14. A method according to claim 13, wherein at least one of said at least one handoff performance metric includes: a) an assignment probability; b) a handoff probability; c) a mean number of handoff value; d) a crossover point; e) an outage probability; f) a macrodiversity degree; and g) an overall signaling load incurred by said handoff mechanism.
 15. A method according to claim 13, wherein said cellular network geometry includes at least one of the following: a) a hexagonal cell pattern; b) a diamond cell pattern; c) a square cell pattern; d) a rhombus cell pattern; and e) a star pattern.
 16. A method according to claim 13, wherein said cellular network geometry includes cells mapped into at least one reduced geometric structure.
 17. A method according to claim 16, wherein said cellular network geometry includes reduced geometric structures mapped into at least one minimum geometric structure.
 18. A method according to claim 13, wherein said signal propagation description includes at least one of the following components: a) a path loss component; b) a shadow fading component; and c) a fast fading component.
 19. A method according to claim 13, wherein said piecewise path is a piecewise linear path.
 20. A method according to claim 13, wherein said handoff mechanism selector is capable of selecting a hard handoff mechanism.
 21. A method according to claim 13, wherein said handoff mechanism selector is capable of selecting a soft handoff mechanism.
 22. A method according to claim 13, wherein said handoff mechanism selector considers at least one of the following: a) assignment regions; b) relative pilot signal strengths; and c) relative processed signal strengths.
 23. A method according to claim 13, wherein said handoff parameters include at least one of the following: a) a hysteresis value; b) a drop timer value; c) an averaging parameter; and d) a handoff decision interval.
 24. A method according to claim 13, wherein said handoff performance metric calculator uses a recursive procedure. 